Fast Parallel String Prefix-Matching
نویسنده
چکیده
An O(log log m) time n log m log logm-processor CRCW-PRAM algorithm for the string preex-matching problem over a general alphabet is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log m loglog m processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the same number of operations.
منابع مشابه
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
In this article, we introduce a new and simple data structure, the prefix table under Hamming distance, and present two algorithms to compute it efficiently: one asymptotically fast; the other very fast on average and in practice. Because the latter approach avoids the computation of global data structures, such as the suffix array and the longest common prefix array, it yields algorithms much ...
متن کاملA Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching
ÐSeveral new number representations based on a Residue Number System are presented which use the smallest prime numbers as moduli and are suited for parallel computations on a reconfigurable mesh architecture. The bit model of linear reconfigurable mesh with exclusive write and unit-time delay for broadcasting on a subbus is assumed. It is shown how to convert in O 1 time any integer, ranging ...
متن کاملDMP-tree: A dynamic M-way prefix tree data structure for strings matching
We propose DMP-tree, a dynamic M-way prefix tree, data structure for the string matching problem in general and prefix matching in particular. DMP-tree has been initially devised for fast and efficiently handling prefix matching which constitutes the building block of some applications in the computer realm and related area. It is assumed there are strings of an alphabet R which are ordered. Th...
متن کاملFaster Multiple Pattern Matching System on GPU based on Bit-Parallelism
In this paper, we propose fast string matching system using GPU for large scale string matching. The key of our proposed system is the use of bit-parallel pattern matching approach for compact NFA representation and fast simulation of NFA transition on GPU. In the experiments, we show the usefulness of our proposed pattern matching system.
متن کاملAlternative Algorithms for Bit-Parallel String Matching
We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 137 شماره
صفحات -
تاریخ انتشار 1995